Morphic Computing: Morphic Systems and Morphic System of Systems (m-sos)
نویسندگان
چکیده
Morphic Computing is based on Field Theory [14-16] and more specifically Morphic Fields. Morphic Fields were first introduced by [18] from his hypothesis of formative causation that made use of the older notion of Morphogenetic Fields. [18] developed his famous theory, Morphic Resonance, on the basis of the work by French philosopher Henri Bergson. Morphic Computingis based on Field Theory and more specifically Morphic Fields. Morphic Computing is a natural extension of Holographic Computation, Quantum Computation, Soft Computing, and DNA Computing. In this paper, we introduce Morphic Systems and Morphic System of
منابع مشابه
Morphic Computing
In this paper, we introduce a new type of computation called “Morphic Computing”. Morphic Computing is based on Field Theory and more specifically Morphic Fields. Morphic Fields were first introduced by Rupert Sheldrake [1981] from his hypothesis of formative causation that made use of the older notion of Morphogenetic Fields. Rupert Sheldrake [1981] developed his famous theory, Morphic Resonan...
متن کاملThe Quasi-morphic Property of Group
A group is called morphic if for each normal endomorphism α in end(G),there exists β such that ker(α)= Gβ and Gα= ker(β). In this paper, we consider the case that there exist normal endomorphisms β and γ such that ker(α)= Gβ and Gα = ker(γ). We call G quasi-morphic, if this happens for any normal endomorphism α in end(G). We get the following results: G is quasi-morphic if and only if, for any ...
متن کاملGeneralizations of Morphic Group Rings
An element a in a ring R is called left morphic if there exists b ∈ R such that 1R(a)= Rb and 1R(b)= Ra. R is called left morphic if every element ofR is left morphic. An element a in a ring R is called left π-morphic (resp., left G-morphic) if there exists a positive integer n such that an (resp., an with an = 0) is left morphic. R is called left π-morphic (resp., left G-morphic) if every elem...
متن کاملA Taxonomy of Morphic Sequences
In this note we classify sequences according to whether they are morphic, pure morphic, uniform morphic, pure uniform morphic, primitive morphic, or pure primitive morphic, and for each possibility we either give an example or prove that no example is possible.
متن کاملThe signature of rational languages
We present here the notion of signature of trees and of languages, and its relationships with the theory of numeration systems. The signature of an ordered infinite tree (of bounded degree) is an infinite (bounded) sequence of integers, the sequence of the degrees of the nodes taken in the visit order of the canonical breadth-first traversal of the tree. A prefix-closed language defines such a ...
متن کامل